User-guided volumetric approximation using swept sphere volumes for physically based animation
نویسندگان
چکیده
We present an efficient, user-guided volumetric approximation algorithm, specifically designed for physically-based animation. Our method combines automatic and interactive segmentation methods to give users an intuitive and easy way to approximate 3D meshes. Our approach first constructs the simplified medial axis transform (MAT) of the input mesh object, and segments the medial axis (MA) into parts in terms of swept sphere volumes (SSVs) using a region growing method. Then, we decompose the object surface into regions based on the mapping between the segmented MA and the object surface. Each segmented region is approximated with a SSV. These decomposed surface regions can be interactively refined further by splitting and/or merging using a sketch-based input. Experimental results show that our approach produces good volumetric approximation results for different types of object shapes. Moreover, rigid-body dynamics simulation based on our volumetric approximation provides a visually pleasing result.
منابع مشابه
Computing swept volumes
The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object (given in a typical boundary representation) to be swept through an arbitrary trajectory. A polyhed...
متن کاملProximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some ooset. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کاملFast Proximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some o set. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کاملPolygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and sweeping along a discrete rigid motion trajectory. Many previous methods focus on the construction of a polygonal superset (containing self-intersections and spurious internal geometry) ...
متن کاملHigh Quality Surface Mesh Generation for Swept Volumes ∗
We present a novel and efficient technique to generate a high quality mesh that approximates the outer boundary of a swept volume (SV). Our approach comes with two guarantees. First, the approximation is conservative, i.e. the swept volume is enclosed by the output mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined toleran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Visualization and Computer Animation
دوره 23 شماره
صفحات -
تاریخ انتشار 2012